import java.util.Scanner;

public class E4T1 {
    public static void swap(int[] nums,int i,int j) {
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
    public static int middleNum(int[] nums,int start,int end) {
        int mid = (end-start)>>1+start;
        if(nums[start]>=nums[end]&&nums[start]>=nums[mid]) {
            if(nums[mid]>=nums[end]) {
                return mid;
            }else {
                return end;
            }
        }else if(nums[mid]>=nums[start]&&nums[mid]>=nums[end]) {
            if(nums[start]>=nums[end]) {
                return start;
            }else {
                return end;
            }
        }else {
            if(nums[start]>=nums[mid]) {
                return start;
            }else {
                return mid;
            }
        }
    }
    public static void quickSort(int[] nums,int start,int end) {
        if(start>=end) {
            return;
        }
        int index = middleNum(nums,start,end);
        swap(nums,index,start);
        int pivot = partition(nums,start,end);
        quickSort(nums,start,pivot-1);
        quickSort(nums,pivot+1,end);
    }
    public static int partition(int[] nums,int start,int end) {
        int left = start;
        int right = end;
        int tmp = nums[left];
        while(left<right) {
            while(right>left && nums[right]>=tmp) {
                right--;
            }
            if(left>=right) {
                break;
            }
            nums[left] = nums[right];
            while(right>left && nums[left]<=tmp) {
                left++;
            }
            if(left>=right) {
                break;
            }
            nums[right] = nums[left];
        }
        nums[left] = tmp;
        return left;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] strs = scanner.nextLine().split(" ");
        int[] nums = new int[strs.length];
        for (int i = 0; i < nums.length; i++) {
            nums[i] = Integer.valueOf(strs[i]);
        }
        quickSort(nums,0,nums.length-1);
        for (int i = 0; i < nums.length; i++) {
            System.out.print(nums[i]+" ");
        }
    }
}
